Energy consumption reduction for asynchronous message-passing applications
نویسندگان
چکیده
منابع مشابه
Improved Dynamic Partial-Order Reduction for Asynchronous Message-Passing Programs
This paper presents two algorithmic refinements that improve systematic testing of asynchronous message-passing programs for a fixed input. Such programs can have a large number of possible execution paths due to the nondeterministic interleaving of messages. However, many paths are equivalent, and dynamic partial-order reduction (DPOR) techniques attempt to explore all distinct, feasible behav...
متن کاملEquations for Asynchronous Message Passing
In [Cza 2006] fix-point equations specifying synchronous (”hand-shaking”) communication in distributed systems have been proposed. Their solution yielded a communication network of agents, directly presented as a Petri net-like structure, and determined the global state of the specified system. The net-places represented agents, while transitions transfer of messages. A special algebra being a ...
متن کاملModeling Asynchronous Message Passing for C Programs
This paper presents a formal modeling paradigm that is callable from C, the dominant language for embedded systems programming, for message passing APIs that provides reasonable assurance that the model correctly captures intended behavior. The model is a suitable reference solution for the API, and it supports putative what-if queries over API scenarios for behavior exploration, reproducibilit...
متن کاملReconciling Real-Time with Asynchronous Message Passing
At rst sight real time and asynchronous message passing like in SDL and ROOM seem to be incompatible Indeed these languages fail to model real time constraints accurately In this paper we show how to reconcile real time with asynchronous message passing by using an assumption which is supported by every mailing system throughout the world namely that messages are time stamped with their sending...
متن کاملMessage Passing for Dynamic Network Energy Management
We consider a network of devices, such as generators, fixed loads, deferrable loads, and storage devices, each with its own dynamic constraints and objective, connected by lossy capacitated lines. The problem is to minimize the total network objective subject to the device and line constraints, over a given time horizon. This is a large optimization problem, with variables for consumption or ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Supercomputing
سال: 2016
ISSN: 0920-8542,1573-0484
DOI: 10.1007/s11227-016-1926-1